Executable Test Sequence for the Protocol Data Portion Based on Two Criteria

نویسنده

Wen-Huei Chen

چکیده

A new test sequence generation method is proposed for testing the conformance of a protocol implementation to its data portion modeled by an Extended Finite State Machine (EFSM), which is represented by a Data Flow Digraph. All-Use and IO-dfchain are two important criteria for selecting paths from the Data Flow Digraph to generate a test sequence which traces the data flow property, but it is a tedious process to select a path which satisfies the criteria while guaranteeing that the generated test sequence is executable (i.e., one that has feasible parameter values). In this paper, we propose a four-step method for generating the executable test sequence. The first step is a manual process, while the other three steps involves automatic as well as optimizing algorithms. The first step involves the manual generation of a Behavior Machine Digraph from the Data Flow Digraph by embedding certain (but not all) parameter values so that every path of the new digraph is executable. Unlike the FSM for circuits, the size of the Data Flow Digraphs for real protocols can be managed test experts. In the second step, executable test paths which trace every association defined by each criterion are generated from the Behavior Machine Digraph. In the third step, the Behavior Machine Digraph is embedded with these test paths so as to construct the SelectUse and SelectIO Digraphs. Finally, the Selecting Chinese Postman Tours of the two digraphs are used to generate the executable test sequences that satisfy the All-Use and IO-df-chain criteria.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times

This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...

متن کامل

Finding Executable Paths In Protocol Conformance Testing

Communication protocol conformance testing aims at demonstrating the adherence of a protocol implementation to the protocol specification which is assumed to be correct. One of the most important issues in protocol testing is the generation of a small set of test sequences with large fault coverage. Since even the simplest protocol may require a very large number of test sequences to assure alm...

متن کامل

Security testing of session initiation protocol implementations

The mechanisms which enable the vast majority of computer attacks are based on design and programming errors in networked applications. The growing use of voice over IP (VOIP) phone technology makes these phone applications potential targets. We present a tool to perform security testing of VOIP applications to identify security vulnerabilities which can be exploited by an attacker. Session Ini...

متن کامل

Automated Test Code Generation from UML Protocol State Machines

This paper presents a framework for automated generation of executable test code from UML 2.0 protocol state machines. It supports several coverage criteria for state models, including state coverage, transition coverage, and basic and extended round-trip coverage. It transforms the state invariants and transition postconditions of a state model into executable assertions to be verified against...

متن کامل